An Optimistic Deadlock Free Adaptive Wormhole Routing Algorithm for Two Dimensional Meshes
نویسندگان
چکیده
This paper proposes a general scheme for deadlock recovery based adaptive wormhole routing by considering a minimal set of additional buffers called recovery buffers. This scheme is then applied to deadlock recovery. When deadlock occurs in adaptive wormhole routing, the scheme routes the deadlocked message through a special recovery network, constructed from a sub set of the available network resources. Safe recovery is performed without loosing the adaptivity in routing. Simulation study revealed that the proposed scheme performs well under high network load.
منابع مشابه
Optimal Fully Adaptive Minimal Wormhole Routing for Meshes
A deadlock-free fully adaptive minimal routing algorithm for meshes that is optimal in the number of virtual channels required and in the number of restrictions placed on the use of these virtual channels is presented. It is also proved that, ignoring symmetry, this routing algorithm is the only fully adaptive routing algorithm with uniform routers that achieves both of these goals. This new al...
متن کاملOptimal Fully Adaptive Minimal Wormhole Routing for Meshes1
A deadlock-free fully adaptive minimal routing algorithm for meshes that is optimal in the number of virtual channels required and in the number of restrictions placed on the use of these virtual channels is presented. It is also proved that, ignoring symmetry, this routing algorithm is the only fully adaptive routing algorithm with uniform routers that achieves both of these goals. This new al...
متن کاملAdaptive Fault-tolerant Wormhole Routing in 2D Meshes
We present an adaptive fault-tolerant wormhole routing algorithm for 2D meshes. The main feature is that with the algorithm, a normal routing message, when blocked by some faulty processor, would detour along the f-polygons around the fault region. The proposed algorithm can tolerate convex faults with only three virtual channels per physical channel regardless of the overlapping of fpolygons o...
متن کاملA New Adaptive Fault-Tolerant Protocol for Direct Multiprocessors Networks
This paper investigates the fault tolerance problem in direct networks. Conservative flow control mechanisms such as Pipelined Circuit Switching (PCS) ensure the existence of a path to the destination before transmission. This ensures achieving reliable fault-tolerant system on the expense of performance. Optimistic flow control mechanisms such as Wormhole Switching (WS) realize very good perfo...
متن کاملA New Theory of Deadlock-free Adaptive Multicast Routing in Wormhole Networks
A theory for the design of deadlock-free adaptive routing algorithms for wormhole networks has been proposed in 11, 14]. This theory supplies the suu-cient conditions for an adaptive routing algorithm to be deadlock-free, even when there are cyclic dependencies between channels. Also, two design methodologies have been proposed. Multicast communication refers to the delivery of the same message...
متن کامل